Avoiding a giant component

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A phase transition for avoiding a giant component

Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges from the complete graph Kn chosen uniformly and independently at random. We prove that there exists a constant c2 such that if c > c2 then whp every graph which contains at least one edge from each ordered pair (ei, fi) has a component of size Ω(n) and if c < c2 then whp there is a graph conta...

متن کامل

Creating a Giant Component

Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosen uniformly and independently at random. Let A be an algorithm for the on-line choice of one edge from each presented pair, and for i = 1, . . . , cn let GA(i) be the graph on vertex set [n] consisting of the first i edges chosen by A. We prove that all algorithms in a c...

متن کامل

The Giant Component

But, we will consider a fancier approach to sampling that yields the same distribution. In particular, we will create a collection of independent random variables Xi,j for all i 6= j. This is twice as many variables as we need, so we will only use one from each pair (Xi,j , Xj,i). We will then choose pairs (i, j) in some order, choose only one of Xi,j or Xj,i to examine, and then use the variab...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Random Structures and Algorithms

سال: 2001

ISSN: 1042-9832,1098-2418

DOI: 10.1002/rsa.1019